Woodall’s conjecture
نویسنده
چکیده
Woodall’s conjecture asserts the following about every directed graph: if every directed cut of the graph has k or more edges then the graph has k or more mutually disjoint dijoins. Here, a dijoin is a set J of arcs such that any vertex is connected to any other by a path all of whose forward-directed arcs are in J . This talk is a little survey of the counterexamples to a generalized version of the conjecture.
منابع مشابه
The answer to Woodall's musquash problem
We prove that there are no n-agonal musquashes for n even with n = 6. This resolves a problem raised in Woodall’s 1971 paper “Thrackles and Deadlock”. A classic problem in graph theory is to draw a graph in the plane with as few crossings as possible. By comparison, a thrackle is an unconventional concept, conceived some 40 years ago by John H. Conway; a thrackle is a drawing in which each pair...
متن کاملPacking Dicycle Covers in Planar Graphs with No K5-e Minor
We prove that the minimum weight of a dicycle is equal to the maximum number of disjoint dicycle covers, for every weighted digraph whose underlying graph is planar and does not have K5 − e as a minor (K5 − e is the complete graph on five vertices, minus one edge). Equality was previously known when forbidding K4 as a minor, while an infinite number of weighted digraphs show that planarity does...
متن کاملOn the crossing number of K ( 9 , 9 ) SURF 2002 Final Report
Because of the large success of very large scale integration (VLSI) technology many researchers have focused on optimizing the VLSI circuit layout. One of the major tasks is minimizing the number of wire crossings in a circuit, as this greatly reduces the chance of cross-talk in long crossing wires carrying the same signal and also allows for faster operation and less power dissipation. The que...
متن کاملNote on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members
Several authors, Brualdi and Scrimger [ 11, Folkman [2] and Woodall [5], have given necessary and sufficient conditions for an infinite family of sets with finitely many infinite members to have a transversal, generalising the well-known theorems of Hall [ 3 ] and Jung and Rado [4 1. In each case the proof of necessity is straightforward. Woodall’s proof of his theorem is one page long, and he ...
متن کاملFrankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کامل